On the Accepting Power of 2-Tape Büchi Automata
نویسنده
چکیده
We show that, from a topological point of view, 2-tape Büchi automata have the same accepting power than Turing machines equipped with a Büchi acceptance condition. In particular, for every non null recursive ordinal α, there exist some Σ α -complete and some Π α -complete infinitary rational relations accepted by 2-tape Büchi automata. This surprising result gives answers to questions of Simonnet [Sim92] and of Lescow and Thomas [Tho90,LT94].
منابع مشابه
Wadge Degrees of Infinitary Rational Relations
We show that, from the topological point of view, 2-tape Büchi automata have the same accepting power as Turing machines equipped with a Büchi acceptance condition. The Borel and the Wadge hierarchies of the class RATω of infinitary rational relations accepted by 2-tape Büchi automata are equal to the Borel and the Wadge hierarchies of ω-languages accepted by realtime Büchi 1-counter automata o...
متن کاملInfinite Games Specified by 2-Tape Automata
We prove that the determinacy of Gale-Stewart games whose winning sets are infinitary rational relations accepted by 2-tape Büchi automata is equivalent to the determinacy of (effective) analytic Gale-Stewart games which is known to be a large cardinal assumption. Then we prove that winning strategies, when they exist, can be very complex, i.e. highly non-effective, in these games. We prove the...
متن کاملPromptness in ω-regular Automata A thesis submitted in partial fulfillment of the requirements for the degree of Master of Science by
Liveness properties of on-going reactive systems assert that something good will happen eventually. In satisfying liveness properties, there is no bound on the “wait time”, namely the time that may elapse until an eventuality is fulfilled. The traditional “unbounded” semantics of liveness properties nicely corresponds to the classical semantics of automata on infinite objects. Indeed, acceptanc...
متن کاملPromptness in ω-regular Automata
Liveness properties of on-going reactive systems assert that something good will happen eventually. In satisfying liveness properties, there is no bound on the “wait time”, namely the time that may elapse until an eventuality is fulfilled. The traditional “unbounded” semantics of liveness properties nicely corresponds to the classical semantics of automata on infinite objects. Indeed, acceptanc...
متن کاملRecurrence and Transience for Probabilistic Automata
In a context of ω-regular specifications for infinite execution sequences, the classical Büchi condition, or repeated liveness condition, asks that an accepting state is visited infinitely often. In this paper, we show that in a probabilistic context it is relevant to strengthen this infinitely often condition. An execution path is now accepting if the proportion of time spent on an accepting s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006